padmini peer dto dpeer distribut astronomi data mine system case studi gener transport system immers video evalu futur minefleetr oveview wide adopt distribut hicl perform data mine system local asynchron distribut privaci preserv featur select algorithm larg peer dto dpeer network icdm abstract assist domain expert activ learn select construct fewer exampl request label build accur classifi previou work activ learn gener specif queri real world applic domain expert oracl readili answer gener queri don care attribut power gener queri gener queri equival specif overli gener queri good answer domain expert oracl highli uncertain make learn difficult paper propos activ learn algorithm ask good gener queri extend algorithm construct hierarch featur nomin numer attribut demonstr experiment method ask significantli fewer queri compar previou work activ learn initi label dataset small oracl inaccur class probabl estim method readili deploi real world data mine task obtain label exampl costli extens paper publish ieee icdm keyword activ learn domain expert gener queri icdm workshop taglearn classifi learn system collabor tag text document assur inform share life cycl local distribut peer dto dpeer algorithm multi dparti optim base privaci preserv data mine primit comput scalabl distribut chang detect astronomi data stream local electr engin surfac curvatur number area comput graphic includ mesh simplif surfac model denois featur detect photorealist line draw techniqu applic estim surfac curvatur due discret model triangular mesh recent curvatur estim limit cpu algorithm forc object geometri resid main memori comput work directli gpu increasingli common object geometri dnetwork outlier detect wireless sensor network address problem unsupervis outlier detect wireless sensor network develop algorithm flexibl respect outlier definit work network commun load proport outcom reveal outcom sensor examin algorithm perform simul real sensor data stream result demonstr algorithm accur impos reason commun load level power consumpt privaci euclidean distanc preserv data perturb approxim distribut dmean cluster peer dto dpeer network gener local algorithm mine data stream larg distribut system abstract larg network comput wireless sensor compon henceforth peer data global state system system function messag rout inform retriev load share reli model global state refer outcom function load experienc peer model system state system constantli chang model date comput global data mine model decis tree mean cluster larg distribut system costli due scale system due commun cost high cost increas dynam scenario data rapidli paper describ step approach deal cost describ highli effici local algorithm monitor wide class data mine model algorithm feedback loop monitor complex function data mean cluster theoret claim corrobor experiment analysi commun effici probabilist algorithm mine frequent itemset peer dto dpeer network topic parallel distribut databas distribut linear program resourc manag data mine distribut environ distribut linear program resourc manag data mine distribut environ effici local algorithm distribut multivari regress peer dto dpeer network paper offer local distribut algorithm multivari regress larg peer peer environ algorithm design distribut inferenc data compact data model classif task emerg peer peer applic bioinformat astronomi social network sensor network web mine comput global regress model data peer node tradit central algorithm regress costli impract larg number data sourc asynchron natur peer peer network dynam natur data network paper propos step approach deal problem offer effici local distribut algorithm monitor qualiti current regress model model outdat algorithm feedback mechan rebuild model local natur monitor algorithm guarante low monitor cost experiment result present paper strongli support theoret claim distribut identif top dl product element applic peer dto dpeer network abstract product measur close featur vector relat import primit popular data mine task cluster classif correl comput decis tree construct entir data set singl site comput product matrix identifi top term magnitud entri trivial real world scenario data distribut locat transmit data central server commun intens scalabl paper present approxim local algorithm identifi top product pair featur vector larg asynchron distribut environ peer peer network develop probabilist algorithm purpos order statist hoeffd bound present experiment result show effect scalabl algorithm final demonstr applic techniqu interest base commun format environ index term distribut data mine product peer topeer network guest editor introduct special section intellig secur informat distribut probabilist inferenc sensor network variat approxim distribut decis dtree induct peer dto dpeer system paper offer scalabl robust distribut algorithm decis tree induct larg peer peer environ comput decis tree larg distribut system standard central algorithm commun expens impract synchron requir problem challeng distribut stream monitor scenario decis tree updat respons data distribut paper present altern solut work complet asynchron manner distribut environ offer low commun overhead necess scalabl seamlessli handl data peer failur paper present extens experiment result corrobor theoret claim index term peer peer data mine decis tree scalabl local algorithm distribut multivari regress paper offer local distribut algorithm multivari regress larg peer peer environ algorithm distribut inferenc data compact data model classif task emerg peer peer applic bioinformat astronomi social network sensor network web mine comput global regress model data peer node tradit central algorithm regress costli impract larg number data sourc asynchron natur peer peer network dynam natur data network paper propos step approach deal problem offer effici local distribut algorithm monitor qualiti current regress model model outdat algorithm feedback mechan rebuild model local natur monitor algorithm guarante low monitor cost experiment result present paper strongli support theoret claim index term peer peer data mine decis tree scalabl local algorithm distribut multivari regress paper offer local distribut algorithm multivari regress larg peer peer environ algorithm distribut inferenc data compact data model classif task emerg peer peer applic bioinformat astronomi social network sensor network web mine comput global regress model data peer node tradit central algorithm regress costli impract larg number data sourc asynchron natur peer peer network dynam natur data network paper propos step approach deal problem offer effici local distribut algorithm monitor qualiti current regress model model outdat algorithm feedback mechan rebuild model local natur monitor algorithm guarante low monitor cost experiment result present paper strongli support theoret claim index term peer peer data mine decis tree uniform data sampl peer dto dpeer network uniform random sampl analyz data take uniform sampl problem entir data resid locat data distribut peer peer network amount data peer collect uniform sampl data challeng task random sampl perform random walk due vari degre connect size data own peer random walk bias sampl paper propos random walk base sampl algorithm sampl data tupl uniformli larg unstructur network model random walk markov chain deriv condit bound length random walk achiev uniform formal commun analysi show logarithm commun cost discov uniform data sampl multi dparti process commun examin complex pbint view sp studi model collect process eo amp quot distribut top dk outlier detect astronomi catalog demac system dnetwork outlier detect wireless sensor network address problem unsupervis outlier detect wireless sensor network develop algorithm flexibl respect outlier definit work network commun load proport outcom reveal outcom sensor examin algorithm perform simul real sensor data stream result demonstr algorithm accur impos reason commun load level power consumpt attack view distanc preserv map privaci preserv data mine abstract examin effect distanc preserv transform privaci preserv data mine techniqu potenti import data mine algorithm effici appli transform data produc result appli origin data distanc base cluster nearest neighbor classif issu origin data hidden knowledg carefulli studi step direct assum role attack arm type prior inform origin data examin attack recov origin data transform data prior inform result offer insight vulner distanc preserv transform dmean cluster larg dynam network local dthreshold base data mine peer dto dpeer system larg network comput wireless sensor mobil devic compon peer data global statu system function system rout decis search strategi data cleans assign mutual trust depend global statu essenti system detect react global statu comput global predic system costli scale case sensor network high cost commun cost increas data rapidli due state node failur comput follow paper describ step approach deal cost describ highli effici local algorithm detect norm averag data surpass threshold algorithm feedback loop monitor complex predic data data mean cluster effici algorithm guarante long cluster result repres data data stationari resourc requir data undergo epoch chang chang underli distribut model longer repres feedback loop model rebuilt exist feedback loop approxim effort method construct model ill fit model built feedback loop model rebuilt distribut data mine peer dto dpeer network distribut data mine deal problem data analysi environ distribut data comput node user peer peer comput emerg distribut comput paradigm applic involv exchang inform larg number peer central coordin file share electron commerc monitor base network sensor exampl paper offer overview distribut data mine applic algorithm environ describ exact approxim distribut data mine algorithm work decentr manner orthogon decis tree paper introduc orthogon decis tree offer effect construct redund free accur meaning represent larg decis treeensembl creat popular techniqu bag boost random forest distribut data stream mine algorithm orthogon decis tree function orthogon correspond princip compon underli function space paper offer techniqu construct tree base eigen analysi ensembl offer experiment result document perform orthogon tree ground accuraci model complex cluster distribut data stream peer dto dpeer environ dboard vehicl data stream monitor minefleet fast resourc constrain monitor correl matric client dside web mine commun format peer dto dpeer environ paper present framework format interest base peer peer commun client side web brows histori propos order statist base algorithm build commun hierarch structur carefulli privaci concern peer adopt cryptograph protocol measur similar peer disclos person profil evalu algorithm distribut data mine toolkit experiment result show framework effici build interest base commun topic parallel distribut databas orthogon decis tree resourc dconstrain physiolog data stream monitor mobil devic challeng applic demand abil data mine resourc constrain devic applic monitor physiolog data stream obtain wearabl sens devic monitor applic pervas healthcar manag senior emerg respons personnel soldier battlefield athlet kei requir monitor system run resourc constrain handheld wearabl devic orthogon decis tree odt offer effect construct redund free accur meaning represent larg decis tree ensembl creat popular techniqu bag boost random forest distribut data stream mine algorithm orthogon decis tree function orthogon correspond princip compon underli function space paper discuss properti odt suitabl monitor physiolog data stream resourc constrain environ offer experiment result document perform orthogon tree ground accuraci model complex characterist resourc constrain mobil environ distribut data mine agent abstract multi agent system ma offer architectur distribut problem solv distribut data mine ddm algorithm focu class distribut problem solv task analysi model distribut data paper offer perspect ddm algorithm context multiag system discuss broadli connect ddm ma high level survei ddm focus distribut cluster algorithm potenti applic multi agent base problem solv scenario review algorithm distribut cluster includ privacypreserv describ challeng cluster sensor network environ potenti shortcom current algorithm futur work discuss confidenti privaci preserv present algorithm privaci preserv densiti base cluster random ddata perturb techniqu privaci dpreserv data mine multi dagent system distribut data mine present gener multi agent system framework distribut data mine base peer peer model framework adopt messag base asynchron commun dynam load balanc polici suitabl irregular search algorithm modular design separ gener purpos system protocol softwar compon specif data mine algorithm gener architectur implement successfulli test parallel frequent subgraph mine algorithm interest issu explor present work discuss introduc ongo research effort aim exploit leverag ma distribut data mine applic base ma distribut data mine decad increas avail larg amount data field scienc applic data mine techniqu popular techniqu reveal valuabl knowledg hidden rough data techniqu requir high perform approach order cope overwhelm amount data complex algorithm effect approach base distribut parallel comput orthogon decis tree paper introduc orthogon decis tree offer effect construct redund free accur meaning represent larg decis treeensembl creat popular techniqu bag boost random forest distribut data stream mine algorithm orthogon decis tree function orthogon correspond princip compon underli function space paper offer techniqu construct tree base eigen analysi ensembl offer experiment result document perform orthogon tree ground accuraci model complex privaci dsensit bayesian network paramet learn paper consid problem learn paramet bayesian network assum structur network privaci sensit dataset distribut multipl parti binari valu dataset show count inform requir estim condit probabl bayesian network obtain solut set linear equat involv product relev featur vector random project base method propos secur comput product modifi implement method commun effici construct decis tree heterogen distribut data present algorithm design effici construct decis tree heterogen distribut data central compar algorithm standard central decis tree implement term accuraci commun complex experiment result show commun cost central data achiev tree accuraci tree produc central version veda mobil distribut data stream mine system real dtime vehicl monitor fourier spectrum dbase approach repres decis tree mine data stream mobil environ paper present fourier analysi base techniqu aggreg transmit visual decis tree mobil environ fourier represent decis tree interest properti mine continu data stream small mobil comput devic paper present algorithm comput fourier spectrum decis tree vice versa offer framework aggreg decis tree fourier represent describ mobimin mobil data mine system mine stock market data handheld devic connect low bandwidth wireless network learn function random genet code dlike transform probabilist properti experiment collect mine bayesian network distribut heterogen data present collect approach learn bayesian network distribut heterogen data approach learn local bayesian network site local data site identifi observ evid coupl local local variabl transmit subset observ central site bayesian network learnt central site data transmit local site local central bayesian network combin obtain collect bayesian network model entir data experiment result theoret justif demonstr feasibl approach present privaci preserv properti random data perturb techniqu privaci increasingli import issu data mine applic trigger develop privaci preserv data mine techniqu larg fraction random data distort techniqu mask data preserv privaci sensit data methodolog attempt hide sensit data randomli modifi data valu addit nois paper question util random distort techniqu privaci preserv paper note random object random matric predict structur spectral domain develop random matrix base spectral filter techniqu retriev origin data dataset distort ad random valu paper present theoret foundat filter method extens experiment result demonstr case random data distort preserv data privaci pervas grid privaci sensit distribut data mine multi dparti data analysi privaci preserv random perturb techniqu explor privaci increasingli import issu data mine applic secur defens area trigger develop privaci preserv data mine techniqu larg fraction random data distort techniqu mask data preserv privaci attempt hide sensit data randomli modifi data valu addit nois paper question util random data distort techniqu preserv privaci case urg caution note random object random matric predict structur spectral domain offer random matrix base spectral filter techniqu retriev origin data data set distort ad random valu extend earlier work question efficaci random perturb techniqu addit nois privaci preserv data mine continu valu domain present result discret domain show grow collect random perturb base privaci preserv data mine techniqu care scrutini order prevent privaci breach linear transform paper present extens experiment result order support claim extens paper random data perturb depend detect mobimin system perspect random matrix dbase approach depend detect data stream resampl techniqu learn fourier spectrum skew data function induct wide studi walsh multidimension discret fourier transform mdft coeffici estim benefit includ fact decis tree construct effici spectrum estim accur uniform data highli skew data norm paper improv accuraci mdft coeffici estim case skew data adapt resampl algorithm learn mdft coeffici present verifi experiment equival estim learn singl pass algorithm defin effect techniqu demonstr control experi resampl techniqu learn fourier spectrum skew data function induct wide studi walsh multidimension discret fourier transform mdft coeffici estim benefit includ fact decis tree construct effici spectrum estim accur uniform data highli skew data norm paper improv accuraci mdft coeffici estim case skew data adapt resampl algorithm learn mdft coeffici present verifi experiment equival estim learn singl pass algorithm defin effect techniqu demonstr control experi construct simpler decis tree ensembl model fourier analysi ensembl learn frequent classif relat applic data mine gener multipl model produc final classif aggreg output model ensembl larg ensembl hard interpret difficult translat action knowledg paper consid construct decis tree fourier spectrum ensembl model user defin rang error fourier spectrum ensembl decis tree retain inform construct simpler inform decis tree approach effect build ensembl base classifi static data set data stream depend detect mobimin random matric paper describ approach detect correl data stream context mobimin experiment mobil data mine system present descript mobimin identifi problem detect depend stock increment observ financi data stream trivial problem stock market data inher noisi small increment volum data make estim process vulner nois distribut paper present algorithm process distribut system determin global state system comput problem distribut system cast term problem detect global state instanc global state detect algorithm help solv import class problem stabl properti detect stabl properti persist stabl properti true remain true exampl stabl properti comput termin system deadlock token token ring disappear stabl properti detect problem devis algorithm detect stabl properti global state detect checkpoint categori subject descriptor comput commun network distribut system distribut applic distribut databas network oper system oper system process manag concurr deadlock multiprocess multiprogram mutual exclus schedul synchron oper system reliabl backup procedur checkpoint restart fault toler verif editori comput gene express machin learn genet code dlike transform book review review advanc distribut parallel knowledg discoveri mobimin monitor stock market pda mine decis tree data stream mobil environ paper present fourier analysi base techniqu aggreg commun visual decis tree mobil environ fourier represent decis tree properti mine continu data stream small mobil comput devic paper present algorithm comput fourier spectrum decis tree vice versa offer framework aggreg decis tree fourier represent describ touchpad ticker base approach visual decis tree fourier spectrum implement pda distribut web mine bayesian network multipl data stream data mine ubiquit kdd mobil distribut environ spatial data mine discoveri interest relationship characterist exist implicitli spatial databas paper explor cluster method role plai spatial data mine end develop cluster method call claran base random search de velop spatial data mine algorithm claran analysi experi show assist claran algorithm effect lead discoveri difficult find current spatial data mine algorithm gene express fast construct distribut evolutionari represent gene express process natur produc protein cell portion dna protein control import activ live organ abstract level gene express view process evalu merit fit dna distribut evalu dna decompos represent fit function defin dna paper argu live bodi provid represent reason effici mechan construct distribut represent paper demonstr polynomi time comput represent propos class effici algorithm main contribut paper fold algorithm side offer scale evolutionari search detect underli structur search space biolog side prove distribut represent evolutionari fit function gene express comput polynomi time distribut cluster collect princip compon analysi paper consid distribut cluster high dimension heterogen data distribut princip compon analysi pca techniqu call collect pca present collect pca techniqu independ cluster applic show integr collect pca shelf cluster algorithm order develop distribut cluster techniqu present experiment result dierent test data set includ applic web mine comput genet code dlike transform distribut parallel knowledg discoveri workshop session titl collect princip compon analysi distribut heterogen data genet code dlike transform effect learn function report workshop distribut parallel knowledg discoveri collect hierarch cluster distribut heterogen data paper present collect hierarch cluster chc algorithm analyz distribut heterogen data algorithm gener local cluster model combin gener global cluster model data propos algorithm run jsjn time jsjn space requir commun requir number element data set jsj number data site approach show signific improv naiv method commun cost case entir distanc matrix transmit nm commun cost central data total number featur specif implement base singl link cluster result compar perform central cluster algorithm present analysi algorithm complex term comput time commun requir pre experiment scalabl gemga paper report recent develop gene express messi genet algorithm gemga research present extens experiment result larg problem massiv multi modal uniform scale overlap problem experiment result corrobor linear time perform gemga wide rang problem decompos smaller overlap overlap problem chosen represent result support scalabl perform gemga introduct recent past wit grow interest design scalabl evolutionari algorithm induct detect decompos partit call genet linkag genet algorithm ga literatur optim problem messi genet algorithm depend tree distribut estim exampl problem decompos smaller subproblem dna protein transform role linkag learn paper present extend perspect linkag basic concept develop search framework kargupta kargupta amp goldberg identifi detect pattern relat search space member fundament broader object linkag learn explor comput role gene express dna rna protein transform evolutionari search relat algebra approach offer strong evid support hypothesi transform gene express form fit invari symmetri group alphabet tupl captur pattern relat search space member introduct intra cellular express genet inform live organ plai critic role emerg form life region dna carrier genet inform transcrib cell organ produc messen scalabl distribut data mine agent architectur search blackbox optim sampl complex search search envis relat amp class hierarch framework develop kargupta offer altern perspect blackbox optim bbo optim presenc domain knowledg search framework investig condit essenti transcend limit random enum search framework develop term relat class partial order paper present summari main result work close form bound sampl complex term cardin relat space class space desir qualiti solut reliabl present primari lesson work bbo search relat solv call class order delin problem polynomi sampl complex result applic blackbox search algorithm includ evolutionari optim techniqu introducti perform gene express messi genet algorithm real test function polynomin complex blackbox search lesson search framework gene express messi genet algorithm paper introduc gene express messi genet algorithm gemga gener messi ga directli search relat member search space gemga ak sam ple complex algorithm class order delin problem problem solv higher order relat gemga design base altern perspect natur evo lution propos search framework em phasiz role gene express gemga transcript oper search relat paper present test result gemga larg multimod order delin problem signal dto dnois spice network model simul signal nois ac coupl singlesid type si micro strip detector connect premux read electron detector respons studi neutron irradi fluenc delta cm compar simul experiment signal nois ratio introduct signal nois ratio kei paramet si micro strip detector determin detector effici gener requir achiev good track capabl cm experi lhc cern perform maintain year oper time fluenc hottest part system expect reach delta cm main compon nois measur charg signal si detector due front end electron charg sensit preamplifi cmo input transistor rapidaccur optim difficult problem fast messi genet algorithm research long sought genet algorithm ga solv difficult search optim machin learn problem quickli year work simpl ga variant unknown difficult problem simpl ga solv quickli solv reliabl radic design departur messi ga mga approach attempt solv problem bound difficulti quickli reliabl take notion build block linkag earli effort appar success achiev polynomi converg difficult problem initi bottleneck requir larg initi popul thought primari obstacl faster mga perform paper replac partial enum initi select primordi phase origin messi ga probabilist complet initi primordi phase inform transmiss genet algorithm shannon theorem order genet algorithm decept paper consid decept context order genet algorithm ga order decept order problem design absolut rel order decod crossov oper absolut rel order problem combin crossov oper code schema surviv probabl calcul simul result show singl crossov oper adequ find global optim solut absolut rel order problem confirm fundament ga theori success genet algorithm depend crossov oper respect underli code problem system identif evolv polynomi network paper aid understand ga behavior set requir divers improv understand area ga activ emploi system requir cooper set interact individu 